CONTINUOUS-TIME QUADRATIC PROGRAMMING PROBLEMS: APPROXIMATE SOLUTIONS AND ERROR ESTIMATION
نویسندگان
چکیده
منابع مشابه
Approximate Solutions of Continuous Dispersion Problems
The problem of positioning p points so as to maximize the minimum distance between them has been studied in both location theory (as the continuous p-dispersion problem) and the design of computer experiments (as the maximin distance design problem). This problem can be formulated as a nonlinear program, either exactly or approximately. We consider formulations of both types and demonstrate tha...
متن کاملQuadratic bi-level programming problems: a fuzzy goal programming approach
This paper presents a fuzzy goal programming (FGP) methodology for solving bi-level quadratic programming (BLQP) problems. In the FGP model formulation, firstly the objectives are transformed into fuzzy goals (membership functions) by means of assigning an aspiration level to each of them, and suitable membership function is defined for each objectives, and also the membership functions for vec...
متن کاملAn approximate dynamic programming approach to convex quadratic knapsack problems
Quadratic knapsack problem (QKP) has a central role in integer and combinatorial optimization, while efficient algorithms to general QKPs are currently very limited. We present an approximate dynamic programming (ADP) approach for solving convex QKPs where variables may take any integer value and all coefficients are real numbers. We approximate the function value using (a) continuous quadratic...
متن کاملOn a method for a-posteriori error estimation of approximate solutions to parabolic problems
The aim of the paper is to derive a method for the construction of a-posteriori error estimate to approximate solutions to parabolic initial-boundary value problems. The computation of the suggested error bound requires only the computation of a finite number of systems or linear algebraic equations. These systems can be solved parallelly. It is proved that the suggested a-posteriori error esti...
متن کاملContinuous quadratic programming formulations of optimization problems on graphs
Four NP-hard optimization problems on graphs are studied: The vertex separator problem, the edge separator problem, the maximum clique problem, and the maximum independent set problem. We show that the vertex separator problem is equivalent to a continuous bilinear quadratic program. This continuous formulation is compared to known continuous quadratic programming formulations for the edge sepa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Taiwanese Journal of Mathematics
سال: 2012
ISSN: 1027-5487
DOI: 10.11650/twjm/1500406604